全文获取类型
收费全文 | 11876篇 |
免费 | 866篇 |
国内免费 | 1057篇 |
专业分类
化学 | 665篇 |
晶体学 | 5篇 |
力学 | 793篇 |
综合类 | 162篇 |
数学 | 10386篇 |
物理学 | 1788篇 |
出版年
2024年 | 10篇 |
2023年 | 132篇 |
2022年 | 153篇 |
2021年 | 193篇 |
2020年 | 271篇 |
2019年 | 314篇 |
2018年 | 278篇 |
2017年 | 330篇 |
2016年 | 294篇 |
2015年 | 266篇 |
2014年 | 508篇 |
2013年 | 1027篇 |
2012年 | 466篇 |
2011年 | 613篇 |
2010年 | 537篇 |
2009年 | 718篇 |
2008年 | 811篇 |
2007年 | 804篇 |
2006年 | 704篇 |
2005年 | 673篇 |
2004年 | 558篇 |
2003年 | 564篇 |
2002年 | 463篇 |
2001年 | 377篇 |
2000年 | 326篇 |
1999年 | 340篇 |
1998年 | 341篇 |
1997年 | 290篇 |
1996年 | 215篇 |
1995年 | 147篇 |
1994年 | 127篇 |
1993年 | 109篇 |
1992年 | 86篇 |
1991年 | 89篇 |
1990年 | 61篇 |
1989年 | 59篇 |
1988年 | 55篇 |
1987年 | 33篇 |
1986年 | 38篇 |
1985年 | 61篇 |
1984年 | 48篇 |
1983年 | 33篇 |
1982年 | 47篇 |
1981年 | 41篇 |
1980年 | 27篇 |
1979年 | 48篇 |
1978年 | 28篇 |
1977年 | 27篇 |
1976年 | 22篇 |
1973年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
《Expositiones Mathematicae》2022,40(2):357-394
We give an informal exposition of pushforwards and orientations in generalized cohomology theories in the language of spectra. The whole note can be seen as an attempt at convincing the reader that Todd classes in Grothendieck–Hirzebruch–Riemann–Roch type formulas are not Devil’s appearances but rather that things just go in the most natural possible way. 相似文献
2.
3.
4.
We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any . 相似文献
5.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7]. 相似文献
6.
利用标量化方法建立对称向量拟均衡问题有效解的存在性定理。作为标量化方法的应用,利用这一方法得到向量变分不等式和拟向量变分不等式有效解的存在性定理。 相似文献
7.
《Discrete Mathematics》2022,345(7):112898
The Hamming distance between two equal-length words u, v is the number of positions where u and v differ. The words u and v are said to be conjugates if there exist non-empty words such that and . The smallest value can take on is 0, when x and y commute. But, interestingly, the next smallest value can take on is 2 and not 1. In this paper, we consider conjugates and where . More specifically, we provide an efficient formula to count the number of length-n words over a k-letter alphabet that have a conjugate such that . We also provide efficient formulae for other quantities closely related to . Finally, we show that grows erratically: cubically for n prime, but exponentially for n even. 相似文献
8.
9.
SongIl Ri 《Indagationes Mathematicae》2018,29(3):962-971
The aim of this paper is to present a new idea to construct the nonlinear fractal interpolation function, in which we exploit the Matkowski and the Rakotch fixed point theorems. Our technique is different from the methods presented in the previous literatures. 相似文献
10.
Theo Steininger Jait Dixit Philipp Frank Maksim Greiner Sebastian Hutschenreuter Jakob Knollmüller Reimar Leike Natalia Porqueres Daniel Pumpe Martin Reinecke Matev raml Csongor Varady Torsten Enßlin 《Annalen der Physik》2019,531(3)
NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy 3, a major upgrade to the original NIFTy framework. NIFTy 3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy 3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy 3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 . 相似文献